Approximability of Dense Instances of NEAREST CODEWORD Problem
نویسندگان
چکیده
We give a polynomial time approximation scheme (PTAS) for dense instances of the Nearest Codeword problem.
منابع مشابه
Polynomial time approximation schemes for dense instances of minimum constraint satisfaction
It is known that large fragments of the class of dense Minimum Constraint Satisfaction (MIN-CSP) problems do not have polynomial time approximation schemes (PTASs) contrary to their Maximum Constraint Satisfaction analogs. In this paper we prove, somewhat surprisingly, that the minimum satisfaction of dense instances of kSAT-formulas, and linear equations mod 2, Ek-LIN2, do have PTASs for any k...
متن کاملFixed-Parameter Approximability of Boolean MinCSPs
The minimum unsatisfiability version of a constraint satisfaction problem (MinCSP) asks for an assignment where the number of unsatisfied constraints is minimum possible, or equivalently, asks for a minimum-size set of constraints whose deletion makes the instance satisfiable. For a finite set Γ of constraints, we denote by MinCSP(Γ) the restriction of the problem where each constraint is from ...
متن کاملImproved Non-approximability Results for Vertex Cover with Density Constraints
We provide new non-approximability results for the restrictions of the Min Vertex Cover problem to bounded-degree, sparse and dense graphs. We show that, for a suuciently large B, the recent 16/15 lower bound proved by Bellare et al. 3] extends with negligible loss to graphs with bounded degree B. Then, we consider sparse graphs with no dense components (i.e. everywhere sparse graphs), and we s...
متن کاملImproved Non-Approximability Results for Minimum Vertex Cover with Density Constraints
We provide new non-approximability results for the restrictions of the Min Vertex Cover problem to bounded-degree, sparse and dense graphs. We show that for a suuciently large B, the recent 16/15 lower bound proved by Bellare et al. 5] extends with negligible loss to graphs with bounded degree B. Then, we consider sparse graphs with no dense components (i.e. everywhere sparse graphs), and we sh...
متن کاملApproximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION
We consider bounded occurrence (degree) instances of a minimum constraint satisfaction problem MIN-LIN2 and a MIN-BISECTION problem for graphs. MIN-LIN2 is an optimization problem for a given system of linear equations mod 2 to construct a solution that sat-isses the minimum number of them. E3-OCC-MIN-E3-LIN2 is the bounded occurrence (degree) problem restricted as follows: each equation has ex...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000